منابع مشابه
Optimizing an Arabic Query using Comprehensive Query Expansion Techniques
By utilizing a search engine for the inquired object, the user may get what he has looked for. However, in the average; the number of words the user comes up with for a query is two or three in general [23]. This mostly causes a number of problems. To overcome such problems, various query expansion techniques have been developed. However, none of them are asserted to present the optimal solutio...
متن کاملEnglish-Dutch CLIR Using Query Translation Techniques
We present a report on our participation in the English-Dutch bilingual task of the 2001 Cross-Language Evaluation Forum (CLEF). We attempted to demonstrate that good cross language query translation results can be obtained by combining a dictionary based and parallel corpus based techniques. A parallel corpus based technique was used to choose the best sense from all possible senses found in t...
متن کاملOn Optimizing Workflows Using Query Processing Techniques
Workflow management systems stand to significantly benefit from database techniques, although current workflow systems have not exploited well-established data management solutions to their full potential. In this paper, we focus on optimization issues and we discuss how techniques inspired by database query plan compilation can enhance the quality of workflows in terms of response time.
متن کاملusing game theory techniques in self-organizing maps training
شبکه خود سازمانده پرکاربردترین شبکه عصبی برای انجام خوشه بندی و کوانتیزه نمودن برداری است. از زمان معرفی این شبکه تاکنون، از این روش در مسائل مختلف در حوزه های گوناگون استفاده و توسعه ها و بهبودهای متعددی برای آن ارائه شده است. شبکه خودسازمانده از تعدادی سلول برای تخمین تابع توزیع الگوهای ورودی در فضای چندبعدی استفاده می کند. احتمال وجود سلول مرده مشکلی اساسی در الگوریتم شبکه خودسازمانده به حسا...
Determinization of Weighted Tree Automata Using Factorizations
We present a determinization construction for weighted tree automata using factorizations. Among others, this result subsumes a previous result for determinization of weighted string automata using factorizations (Kirsten and Mäurer, 2005) and two previous results for weighted tree automata, one of them not using factorizations (Borchardt, 2004) and one of them restricted to nonrecursive automa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Research in Engineering and Technology
سال: 2016
ISSN: 2321-7308,2319-1163
DOI: 10.15623/ijret.2016.0516095